Small Gene Networks: Finding Optimal Models Small Gene Networks: Finding Optimal Models
نویسندگان
چکیده
Genetic networks help in identifying interactions between genes, and provide information about the function role of individual genes in the cellular system. In this thesis, we have employed a Bayesian framework to learn network structures from microarray data, and implemented an algorithm that uses dynamic programming to find the optimal gene network model for a small number of genes. To test its performance, we applied the method to two distinctive synthetic datasets. ROC graphs were used to evaluate the effects of noise and a small number of samples, features that are known to be characteristic of gene expression datasets. Results showed significant improvements when the numbers of samples in a dataset were increased. The effect of adding noise to the data gave unexpected results and requires further analysis. The method was finally applied to a real microarray dataset, and led to biologically plausible results. Small Gene Networks: Finding Optimal Models
منابع مشابه
Application of n-distance balanced graphs in distributing management and finding optimal logistical hubs
Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...
متن کاملModeling gene regulatory networks: Classical models, optimal perturbation for identification of network
Deep understanding of molecular biology has allowed emergence of new technologies like DNA decryption. On the other hand, advancements of molecular biology have made manipulation of genetic systems simpler than ever; this promises extraordinary progress in biological, medical and biotechnological applications. This is not an unrealistic goal since genes which are regulated by gene regulatory ...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملPrediction of Blasting Cost in Limestone Mines Using Gene Expression Programming Model and Artificial Neural Networks
The use of blasting cost (BC) prediction to achieve optimal fragmentation is necessary in order to control the adverse consequences of blasting such as fly rock, ground vibration, and air blast in open-pit mines. In this research work, BC is predicted through collecting 146 blasting data from six limestone mines in Iran using the artificial neural networks (ANNs), gene expression programming (G...
متن کاملFinding Optimal Models for Small Gene Networks
Finding gene networks from microarray data has been one focus of research in recent years. Given search spaces of super-exponential size, researchers have been applying heuristic approaches like greedy algorithms or simulated annealing to infer such networks. However, the accuracy of heuristics is uncertain, which--in combination with the high measurement noise of microarrays--makes it very dif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004